Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach

We tackle the thief orienteering problem (ThOP), an academic multi-component that combines two classical combinatorial problems, namely Knapsack Problem and Orienteering Problem. In ThOP, a has time limit to steal items distributed in given set of cities. While traveling, collects by storing them their knapsack, which turn reduces travel speed. The as objective maximize total profit stolen items. this article, we present approach swarm-intelligence with randomized packing heuristic. Our solution outperforms existing works on almost all 432 benchmarking instances, significant improvements.